Localization for linearly edge reinforced random walks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directionally Reinforced Random Walks

This paper introduces and analyzes a class of directionally reinforced random walks The work is motivated by an elementary model for time and space correlations in ocean surface wave elds We develop some basic properties of these walks For instance we investigate recurrence properties and give conditions under which the limiting continuous versions of the walks are Gaussian di usion processes M...

متن کامل

Attracting Edge and Strongly Edge Reinforced Walks

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function W taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting edge at all large times. The statement of the main theorem is very close to settling a conjecture of Sellke [Technical Report 94-26 (1994) Purdue Univ.]. An imp...

متن کامل

Localization in lattice and continuum models of reinforced random walks

K e y w o r d s A g g r e g a t i o n , Lattice walks, Forward-backward parabolic, Coarsening process. 1. I N T R O D U C T I O N M o v e m e n t is a f u n d a m e n t a l process for a lmos t all biological o rganisms , rang ing f rom t h e single cell level to t h e p o p u l a t i o n level, and two m a j o r classes of models a re wide ly used to descr ibe movemen t . In s p a c e j u m p ...

متن کامل

2 00 6 Attracting edge and strongly edge reinforced walks

The goal is to show that an edge reinforced random walk on a graph of bounded degree, with reinforcement weight function W taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting edge at all large times. The statement of the main theorem is very close to settling the original conjecture of Sellke (1994). An important corollary of this ma...

متن کامل

Reinforced Random Walks and Adic Transformations

To a given finite graph we associate three kinds of adic, or BratteliVershik, systems: stationary, symbol-count, and reinforced. We give conditions for the natural walk measure to be adic-invariant and identify the ergodic adicinvariant measures for some classes of examples. If the walk measure is adicinvariant we relate its ergodic decomposition to the vector of limiting edge traversal frequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Duke Mathematical Journal

سال: 2014

ISSN: 0012-7094

DOI: 10.1215/00127094-2644357